On the geometry of real or complex supersolvable line arrangements

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gallery Posets of Supersolvable Arrangements

We introduce a poset structure on the reduced galleries in a supersolvable arrangement of hyperplanes. In particular, for Coxeter groups of type A or B, we construct a poset of reduced words for the longest element whose Hasse diagram is the graph of reduced words. Using Rambau’s Suspension Lemma, we show that these posets are homotopy equivalent to spheres. We furthermore conjecture that its i...

متن کامل

Complex Arrangements: Algebra, Geometry, Topology

A hyperplane arrangement A is a finite collection of hyperplanes in some fixed (typically real or complex) vector space V. For simplicity, in this overview we work over the complex numbers C. There is a host of beautiful mathematics associated to the complement X = V A. Perhaps the first interesting result in the area was Arnol’d’s computation [2] of the cohomology ring of the complement of the...

متن کامل

Topology and combinatorics of real line arrangements

We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in P. Such pair of arrangements has an additional property: they admit conjugated equations on the ring of polynomials over Q( √ 5).

متن کامل

Real line arrangements and fundamental groups

Let A be a real line arrangement in P(R), and let AC be its complexification. Let CC be the complement P (C) \ ⋃ AC. Let G be the Galois group of C/R. We construct a G-equivariant 2-dimensional strong deformation retract of CC. As an application, we give an explicit presentation of the orbifold fundamental group π1(CC//G), and deduce from it an explicit presentation of the ordinary fundamental ...

متن کامل

On the Geometry of Graph Arrangements

We use the results of [5], [6] to discuss the counting formulas of network flow polytopes and magic squares, i.e. the formula for the corresponding Ehrhart polynomial in terms of residues. We also discuss a description of the big cells using the theory of non broken circuit bases.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2016

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2016.01.001